A vectorization for nonconvex set-valued optimization

Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems

The purpose of this paper is to consider the set-valued optimization problem in Asplund spaces without convexity assumption. By a scalarization function introduced by Tammer and Weidner (J Optim Theory Appl 67:297–320, 1990), we obtain the Lagrangian condition for approximate solutions on set-valued optimization problems in terms of the Mordukhovich coderivative.

Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization

Unfortunately, the incorrect version of [1, Theorem 4.3] was published. The correct version of [1, Theorem 4.3] is given in this paper. By employing the generalized higher-order contingent derivatives of set-valued maps, Wang et al. [1] established a sufficient optimality condition of weakly efficient solutions for (SV P): (SV P) min F(x), s.t. G(x) (−D) = ∅, x ∈ E. Theorem 1 (see [1, Theorem 4...

A fixed point result for a new class of set-valued contractions

In this paper, we introduce a new class of set-valued contractions and obtain a xed point theoremfor such mappings in complete metric spaces. Our main result generalizes and improves many well-known xed point theorems in the literature.

Optimality Conditions for Vector Optimization with Set-Valued Maps

In this paper, we establish a Farkas-Minkowski type alternative theorem under the supposition of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we present necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization problems with extended inequality constraints in a sense of weak E-minimizers.

K-epiderivatives for set-valued functions and optimization